Refining the arithmetical hierarchy of classical principles
نویسندگان
چکیده
We refine the arithmetical hierarchy of various classical principles by finely investigating derivability relations between these over Heyting arithmetic. mainly investigate some restricted versions law excluded middle, De Morgan's law, double negation elimination, collection principle and constant domain axiom.
منابع مشابه
The Logic of Arithmetical Hierarchy
Dzhaparidze, G., The logic of arithmetical hierarchy, Annals of Pure and Applied Logic 66 (1994) 89-112. Formulas of the propositional modal language with the unary modal operators 0, H,, B,, Zz, I!!,, are considered as schemata of sentences of arithmetic (PA), where q A is interpreted as (a formalization of) “A is PA-provable”, X,,A as “A is PA-equivalent to a &-sentence” and &,A as “A is PA-e...
متن کاملFuzzy Logic and Arithmetical Hierarchy III
Fuzzy logic is understood as a logic with a comparative and truth-functional notion of truth. Arithmetical complexity of sets of tautologies (identically true sentences) and satissable sentences (sentences true in at least one interpretation) as well of sets of provable formulas of the most important systems of fuzzy predicate logic is determined or at least estimated .
متن کاملFormal language theory: refining the Chomsky hierarchy.
The first part of this article gives a brief overview of the four levels of the Chomsky hierarchy, with a special emphasis on context-free and regular languages. It then recapitulates the arguments why neither regular nor context-free grammar is sufficiently expressive to capture all phenomena in the natural language syntax. In the second part, two refinements of the Chomsky hierarchy are revie...
متن کاملAn Arithmetical Hierarchy in Propositional Dynamic Logic
Propositional dynamic logic (PDL), as introduced by Fischer and Ladner (1979) is the propositional part of the dynamic logic of Pratt (1976). Our aim in this paper is to answer a basic question: Does every alternation of modalities add to the expressive power of the logic? We give a positive answer to the question by building models where modalities behave (somewhat) like quantifiers in first-o...
متن کاملAchilles and the Tortoise Climbing Up the Arithmetical Hierarchy
In this paper we show how to construct for every set P of integers in the arithmetical hierarchy a dynamical system H with piecewise constant derivatives PCD such that deciding membership in P can be reduced to solving the reachability problem between two ratio nal points for H The ability of such apparently simple dynami cal systems whose de nition involves only rational parameters to solve hi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Logic Quarterly
سال: 2022
ISSN: ['0942-5616', '1521-3870']
DOI: https://doi.org/10.1002/malq.202000077